منابع مشابه
On Termination of One Rule Rewrite Systems
The undecidability of the termination of rewrite systems is usually proved by reduction to the halting of Turing machines. In particular, Dauchet proves the unde-cidability of the termination of one rule rewrite systems by coding Turing machines into one rule rewrite systems. Rewrite systems are a very simple model of computation and one may expect proofs in this model to be more straightforwar...
متن کاملSimple Termination of Rewrite Systems
In this paper we investigate the concept of simple termination. A term rewriting system (TRS for short) is called simply terminating if its termination can be proved by means of a simplification order. We propose a new definition of simplification order and we investigate the properties of the resulting class of simply terminating systems.
متن کاملProving Termination of Higher-order Rewrite Systems
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [Nip9l, Nip93]. This formalism combines the computational aspects of term rewriting and simply typed lambda calculus. Our result is a proof technique for the termination of a HRS, similar to the proof technique "Termination by interpretation in a well-founded monotone algebra" described in [Zan93]. T...
متن کاملProving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. We extend their work to non-left-linear rewrite systems. The key to this extension is the introduction of so-called raise rules and the use of tree automata that are not quite deterministic. Furthermore, we present ne...
متن کاملInnermost Termination of Rewrite Systems by Labeling
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rules. A variant of semantic labeling is predictive labeling where the quasi-model condition is only required for the usable rules. In this paper we investigate how semantic and predictive labeling can be used to prove in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00029-8